An Efficient Ant Colony Algorithm Based on Rank 2 Matrix Approximation Method for Aircraft Arrival/Departure Scheduling Problem

نویسندگان

چکیده

The Aircraft Arrival/Departure Problem (AADSP) is the core problem in current runway system, even has become bottleneck to prevent improvement of airport efficiency. This paper studies single AADSP. A Mixed Integer Programming (MIP) model constructed and an algorithm named Ant Colony based on Rank 2 Matrix Approximation (RMA-AC) method proposed. Numerical results validate that new algorithm, as well model, exhibits better performance than CPLEX traditional two-phase algorithm. efficiency enhanced by RMA-AC, within 20 s computation, about 2–5% for 800 aircraft sequences. It a promising improve future scheduling system.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...

متن کامل

Ant Colony Algorithm for Surgery Scheduling Problem

Considering the complete process of surgery including the preoperative and postoperative stages, multiple resource constraints involved and the integration of surgical upstream and downstream resources, surgery scheduling was described as an extended multi-resource constrained flexible job-shop scheduling problem and an optimization approach was proposed based on an improved ant colony algorith...

متن کامل

Rank-Based Ant Colony Algorithm For A Thermal Generator Maintenance Scheduling Problem

The maintenance scheduling of thermal generators is a large-scale combinatorial optimization problem with constraints. In this paper we introduce the Rank-Based Ant System algorithm based version of the Ant System. This algorithm reinforces local search in neighborhood of the best solution found in each iteration while implementing methods to slow convergence and facilitate exploration.Rank-Bas...

متن کامل

An ant colony optimization algorithm for job shop scheduling problem

The nature has inspired several metaheuristics, outstanding among these is Ant Colony Optimization (ACO), which have proved to be very effective and efficient in problems of high complexity (NP-hard) in combinatorial optimization. This paper describes the implementation of an ACO model algorithm known as Elitist Ant System (EAS), applied to a combinatorial optimization problem called Job Shop S...

متن کامل

new ant colony algorithm method based on mutation for fpga placement problem

many real world problems can be modelled as an optimization problem. evolutionary algorithms are used to solve these problems. ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. these ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. ant colony optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Processes

سال: 2022

ISSN: ['2227-9717']

DOI: https://doi.org/10.3390/pr10091825